-
1 coloring problem
Большой англо-русский и русско-английский словарь > coloring problem
-
2 coloring problem
1) Математика: задача раскрашивания2) Вычислительная техника: задача раскраски -
3 coloring problem
мат. -
4 graph coloring problem
проблема окрашивания графа
Проблема определения, может ли граф быть окрашен фиксированными триадами красок так, чтобы смежных вершины всегда имели разный цвет. Две вершины считаются смежными, если они соединяются одной гранью.
[[http://www.rfcmd.ru/glossword/1.8/index.php?a=index&d=23]]Тематики
EN
Англо-русский словарь нормативно-технической терминологии > graph coloring problem
-
5 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
6 задача раскрашивания
Большой англо-русский и русско-английский словарь > задача раскрашивания
См. также в других словарях:
Road coloring problem — In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from… … Wikipedia
Problem der exakten Überdeckung — Das Problem der exakten Überdeckung (englisch Exact Cover) ist ein Entscheidungsproblem der Kombinatorik. Es gehört zu den 21 klassischen NP vollständigen Problemen, von denen Richard M. Karp 1972 gezeigt hat, dass sie NP vollständig sind.… … Deutsch Wikipedia
Problem der Museumswächter — Das Problem der Museumswächter (en: Art gallery problem) ist eine Fragestellung der Algorithmischen Geometrie. Dabei wird folgende Situation untersucht: „Gegeben sei eine polygonale Fläche G mit Rand , interpretiert als Grundriss eines Museums.… … Deutsch Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… … Wikipedia
Map-coloring games — Several map coloring games are studied in combinatorial game theory. The general idea is that we are given a map with regions drawn in but with not all the regions colored. Two players, Left and Right, take turns coloring in one uncolored region… … Wikipedia
Independent set problem — In mathematics, the independent set problem (IS) is a well known problem in graph theory and combinatorics. The independent set problem is known to be NP complete. It is almost identical to the clique problem. Description Given a graph G , an… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Hitting-Set-Problem — Das Hitting Set Problem ist ein NP vollständiges Problem aus der Mengentheorie. Es gehört zur Liste der 21 klassischen NP vollständigen Probleme von denen Richard M. Karp 1972 die Zugehörigkeit zu dieser Klasse zeigen konnte. Gegeben ist eine… … Deutsch Wikipedia
Hadwiger–Nelson problem — Unsolved problems in mathematics How many colors are needed to color the plane so that no two points at unit distance are the same color? In geometric graph theory, the Hadwiger–Nelson problem, named after Hugo Hadwiger and Edward Nelson, asks… … Wikipedia